Globally Adaptive Load-Balanced Routing on Tori
نویسندگان
چکیده
منابع مشابه
Globally Adaptive Load-Balanced Routing on k-ary n-cubes
We introduce a new method of adaptive routing on k-ary ncubes that we refer to as Globally Adaptive Load-balance (GAL). Unlike previous adaptive routing algorithms that make routing decisions based on local information (typically channel queue depth), GAL senses congestion globally using segmented injection queues to decide the directions to route in each dimension. It further load balances the...
متن کاملAdaptive Load Balanced Approach for Multi-path Routing in VANETS
The VANETs carry several security considerations. One in every of the popular and dangerous attacks is launched within the variety of Sybil, connectivity holes or cut-up attack, wherever associated in Nursing assaulter inserts a faux position inside within the cluster. The inserted faux node data is used by the hackers within the case of inconsiderate driver, traffic jams, selective collisions ...
متن کاملVBMAR: Virtual Network Load Balanced Minimal Adaptive Routing
Fully adaptive routing with less virtual channels is of technical trend in MPP interconnection network design. However, imbalance of load offsets performances of many schemes. In this paper we give a fully adaptive load balanced routing algorithm called VBMAR. A new design tool called crossed turn model (CTM) is proposed to solve complex deadlock problems across virtual networks while keep the ...
متن کاملHierarchical load-balanced routing via bounded randomization
The purpose of routing protocols in a computer network is to maximize network throughput. Popular shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. That is, the shortest path between a source and a destination may become highly congested even when many other paths have low utilization. In this paper, we propose a routing scheme for hi...
متن کاملLoad-Balanced Anycast Routing in Computer Networks
We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers and processing elements of a computer network. To accomplish this, the minimum-delay routing problem formulated by Gallager is generalized into the problem of minimum-delay routing with load-balancing to account for processing delays in network nodes (servers an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Computer Architecture Letters
سال: 2004
ISSN: 1556-6056
DOI: 10.1109/l-ca.2004.8